Lecture 01 — Feb 7 , 2012
نویسنده
چکیده
In this first lecture we cover results on persistent data structures, which are data structures where we keep all information about past states. Persistent data structures are part of the larger class of temporal data structures. The other kind of temporal data structures, retroactive data structures, are the topic of lecture 2. Usually we deal with data structure updates by mutating something in the existing data structure: either its data or the pointers that organize it. In the process we lose information previous data structures states. Persistent data structures do not lose any information. For several cases of data structures and definitions of persistence it is possible to transform a plain data structure into a persistent one with asymptotically minimal extra work or space overhead. A recurring theme in this area is that the model is crucial to the results. Partial and full persistence correspond to time travel with a branching universe model such as the one in Terminator, and Deja Vu parts 1 and 2
منابع مشابه
KOWSAR Trauma, Dissociation,and High-Risk Behaviors
Article history: Received: 07 Dec 2011 Revised: 20 Dec 2011 Accepted: 01 Feb 2012
متن کاملSelf-reproduction for articulated behaviors with dual humanoid robots using on-line decision tree classification
Downloaded: 01 Feb 2012 IP address: 128.172.52.154 Robotica (2012) volume 30, pp. 315–332. © Cambridge University Press 2011. The online version of this article is published within an Open Access environment subject to the conditions of the Creative Commons Attribution-NonCommercial-ShareAlike licence . The written permission of Cambridge Univ...
متن کامل2 Finishing the Description of Fusion Trees 2.1 Motivation 2.2 the Problem -fixed-universe Successor 2.3 Overview of Fusion Trees
More generally, the goal of fusion trees is to support the operations insert(x), delete(x), successor(x) and predecessor(x) in o(lgn) time on a transdichotomous RAM. The transdichotomous RAM model of computation was intrdouced in Lecture 2 (Feb. 12, 2003). The data-structure problem defined by these four operations is called the fixed-universe successor problem which was introduced in Lecture 1...
متن کاملSAR Motion Imagery Metadata
[1] SMPTE ST 336:2007, Data Encoding Protocol Using Key-Length-Value [2] SMPTE RP 210v13:2012, Metadata Element Dictionary [3] MISB ST 0807.13, MISB KLV Metadata Dictionary, Feb 2014 [4] MISB ST 0801.5, Photogrammetry Metadata Set for Digital Motion Imagery, Feb 2014 [5] MISB ST 0107.2, Bit and Byte Order for Metadata in Motion Imagery Files and Streams, Feb 2014 [6] MISB ST 0603.2, Common Time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012